A Methodology for Equational Reasoning
نویسندگان
چکیده
1 This paper presents a methodology to guide equa-tional reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use attributes of terms and heuristics to determine bridge lemmas, i.e. lemmas which have to be used during the proof of the theorem. Once we have found such a bridge lemma we use the techniques of diierence uniication and rippling to enable its use.
منابع مشابه
On the mathematical synthesis of equational logics
Birkhoff [1935] initiated the general study of algebraic structure. Importantly for our concerns here, his development was from (universal) algebra to (equational) logic. Birkhoff’s starting point was the informal conception of algebra based on familiar concrete examples. Abstracting from these, he introduced the concepts of signature and equational presentation, and thereby formalised what is ...
متن کاملMathematical Synthesis of Equational Deduction Systems
Our view of computation is still evolving. The concrete theories for specific computational phenomena that are emerging encompass three aspects: specification and programming languages for describing computations, mathematical structures for modelling computations, and logics for reasoning about properties of computations. To make sense of this complexity, and also to compare and/or relate diff...
متن کاملAlgebraic Meta-Theories and Synthesis of Equational Logics
Fiore and Hur [18] recently introduced a novel methodology—henceforth referred to as Sol—for the Synthesis of equational and rewriting logics from mathematical models. In [18], Sol was successfully applied to rationally reconstruct the traditional equational logic for universal algebra of Birkhoff [3] and its multi-sorted version [26], and also to synthesise a new version of the Nominal Algebra...
متن کاملNondeterminism in the APM methodology
This paper looks at the issues involved in incorporating nondetermin-ism into functional languages and particularly in representing the nonde-terminacy which may arise in representing parallel programs in a functional language. It presents an implementation which does so without breaking the ability to perform equational reasoning, and shows how it may be incorporated into the APM (Abstract Par...
متن کاملParameterized Metareasoning in Membership Equational Logic
Basin, Clavel, and Meseguer showed in [1] that membership equational logic is a good metalogical framework because of its initial models and support of reflective reasoning. A development and an application of those ideas was presented later in [4]. Here we further extend the metalogical reasoning principles proposed there to consider classes of parameterized theories and apply this reflective ...
متن کامل